package gold.digger;

import gold.utils.InputUtil;
import gold.vo.CodeDoc;
import gold.vo.ListNode;
import gold.vo.TreeNode;

import java.util.Arrays;

/**
 * Created by fanzhenyu02 on 2020/6/27.
 * common problem solver template.
 */
public class LC100 {
    public long startExecuteTime = System.currentTimeMillis();


    class Solution {
        public boolean isSameTree(TreeNode p, TreeNode q) {
            if (null == p && null == q) return true;
            if (p != null && q != null) {
                if (p.val != q.val) return false;
                return isSameTree(p.left, q.left) && isSameTree(p.right, q.right);
            }

            return false;
        }
    }

    public void run() {
        Solution solution = new Solution();
        ListNode head = ListNode.createList("1->2->3->4->5");
        System.out.println(solution.toString());
    }

    public static void main(String[] args) throws Exception {
        LC100 an = new LC100();
        an.run();

        Arrays.toString("".split(","));
        InputUtil.run();
        CodeDoc.run();
        System.out.println("\ncurrent solution total execute time: " + (System.currentTimeMillis() - an.startExecuteTime) + " ms.");
    }
}
